The Distribution of Condition Numbers of Rational Data of Bounded Bit Length
نویسندگان
چکیده
We prove that rational data of bounded input length are uniformly distributed (in the classical sense of H. Weyl, in [42]) with respect to the probability distribution of condition numbers of Numerical Analysis. We deal both with condition numbers of Linear Algebra and with condition numbers for systems of multivariate polynomial equations. For instance, we prove that for a randomly chosen n×n rational matrix M of bit length O(n log n) + log w, the condition number k(M) satisfies k(M) ≤ wn with probability at least 1 − 2w−1. Similar estimates are established for the condition number μnorm of M. Shub and S. Smale when applied to systems of multivariate homogeneous polynomial equations of bounded input length. Finally, we apply these techniques to estimate the probability distribution of the precision (number of bits of the denominator) required to write down approximate zeros of systems of multivariate polynomial equations of bounded input length.
منابع مشابه
On the uniform distribution of rational inputs with respect to condition numbers of Numerical Analysis
We show that rational data of bounded input length are uniformly distributed with respect to condition numbers of numerical analysis. We deal both with condition numbers of Linear Algebra and with condition numbers for systems of multivariate polynomial equations. For instance, we show that for any w > 1 and for any n× n rational matrix M of bit length O(n4 log n)+logw, the condition number k(M...
متن کاملSystems of rational polynomial equations have polynomial size approximate zeros on the average
A new technique for the Geometry of Numbers is exhibited. This technique provides sharp estimates on the number of bounded height rational rational points in subsets of projective space whose “projective cone” is semi–algebraic. This technique improves existing techniques as the one introduced by H. Davenport in [15]. As main outcome, we conclude that systems of rational polynomial equations of...
متن کاملParticles Size Distribution Effect on 3d Packing of Nanoparticles Into a Bounded Region
In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...
متن کاملLog-Normal and Mono-Sized Particles’ Packing into a Bounded Region
Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...
متن کاملNew High Secure Network Steganography Method Based on Packet Length
In network steganography methods based on packet length, the length of the packets is used as a carrier for exchanging secret messages. Existing methods in this area are vulnerable against detections due to abnormal network traffic behaviors. The main goal of this paper is to propose a method which has great resistance to network traffic detections. In the first proposed method, the sender embe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Foundations of Computational Mathematics
دوره 2 شماره
صفحات -
تاریخ انتشار 2002